A two-stage flow shop scheduling with a critical machine and batch availability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-stage Flow Shop Scheduling with a Critical Machine and Batch Availability

We study a two-stage flowshop, where each job is processed on the first (critical) machine, and then continues to one of two second-stage (dedicated) machines. We assume identical (but machine-dependent) job processing times. Jobs are processed on the critical machine in batches, and a setup time is required when starting a new batch. The setting assumes batch-availability, i.e., jobs become av...

متن کامل

Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

متن کامل

Batch Scheduling in a Two-machine Flow Shop with Limited Buffer

The problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number c of parts is known to be NP-hard for any c > 0 and c ≤ n, where n is the number of jobs. In this paper we analyze this problem in the context of batch scheduling, i.e, when identical parts must be processed consecutively. In particular we study the ca...

متن کامل

Approximation Algorithms for the Two-Machine Flow Shop No-Wait Scheduling with a Non-Availability Interval

We study the two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a given time interval. The objective is to minimize the makespan. The problem is known to be NP-hard, and in the case of several non-availability intervals is not approximable within a constant factor. We consider all possible scenarios of handling the operation af...

متن کامل

Batch Scheduling in Flexible Flow Shop

In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations of Computing and Decision Sciences

سال: 2012

ISSN: 2300-3405,0867-6356

DOI: 10.2478/v10209-011-0004-y